Parallel Hash-Based Join Algorithms for a Shared-Everything
نویسندگان
چکیده
We analyze the costs, and describe the implementation, of three hashed-based join algorithms for a general-purpose shared-memory multiprocessor. The three algorithms considered are the Hashed Loops, GRACE and Hybrid algorithms. We also describe the results of a set of experiments which validate the cost models presented and demonstrate the relative performance of the three algorithms.
منابع مشابه
Performance Analysis of a Load Balancing Hash-Join Algorithm for a Shared Memory Multiprocessor
Within the last several years, there has been a growing interest in applying general multiprocessor systems to relational database query processing. Efficient parallel algorithms have been designed for the join operation but usually have a failing in that their performance deteriorates greatly when the data is nonuniform. In this paper, we propose a new version of the hashbased join algorithm t...
متن کاملPerformance of Grace Hash Join Algorithm on the Ksr-1 Multiprocessor: Evaluation and Analysis Performance of Grace Hash Join Algorithm on the Ksr-1 Multiprocessor: Evaluation and Analysis
In relational database systems, the join is one of the most expensive but fundamental query operations. Among various join methods, the hash-based join algorithms show great potential as they lend themselves for parallelization. Although performance of the hash join algorithm has been evaluated for many architectures, to the best of our knowledge, it has not been evaluated for the COMA memory a...
متن کاملHash-Based Join Algorithms for Multiprocessor Computers with Shared Memory
This paper studies a number of hash-based join algorithms for general purpose multiprocessor computers with shared memory where the amount of memory allocated to the join operation is proportional to the number of processors assigned to the operation and a global hash table is built in this shared memory. The concurrent update and access to this global hash table is studied. The elapsed time an...
متن کاملParallel Join Algorithms based on Parallel B+-trees
Within the last several years, a number of parallel algorithms for the join operation have been proposed. However, almost all of the algorithms did not take advantages of the underlying parallel storage structures or data declustering methods of the operand relations. This paper introduces the concept of parallel storage structure or declustering aware parallel join algorithm. A parallel B+-tre...
متن کاملNested Loops Revisited
The research community has considered hash-based parallel join algorithms the algorithms of choice for almost a decade. However, almost none of the commercial parallel database systems use hashing-based join algorithms, using instead nested-loops with index or sort-merge. While the research literature abounds with comparisons between the various hash-based and sort-merge join algorithms, to our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Knowl. Data Eng.
دوره 6 شماره
صفحات -
تاریخ انتشار 1994